Robustness among multiwinner voting rules
نویسندگان
چکیده
We investigate how robust the results of committee elections are with respect to small changes in input preference orders, depending on voting rules used. find that for typical effect making a single swap adjacent candidates order is either (1) at most one member might be replaced, or (2) it possible whole will replaced. also show problem computing smallest number swaps lead changing election outcome typically NP-hard, but there natural FPT algorithms. Finally, we assess experimentally average random necessary change result.
منابع مشابه
Robustness Among Multiwinner Voting Rules
We investigate how robust are results of committee elections to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates in a single preference order is either that (1) at most one committee member can be replaced, or (2) it is possible that the whole committee can be replaced. We a...
متن کاملProperties of multiwinner voting rules
The goal of this paper is to propose and study properties of multiwinner voting rules (with a particular focus on rules based in some way on single-winner scoring rules). We consider, e.g., SNTV, Bloc, k-Borda, STV, and several variants of Chamberlin–Courant’s and Monroe’s rules, identify two natural approaches to defining multiwinner rules, and show that many of our rules can be captured by on...
متن کاملModeling Representation of Minorities Under Multiwinner Voting Rules
The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility for some of these rules to achieve proportional representation.
متن کاملStatistical Robustness of Voting Rules
We introduce a notion of “statistical robustness” for voting rules. We say that a voting rule is statistically robust if the winner for a profile of ballots is most likely to be the winner of any random sample of the profile, for any positive sample size. We show that some voting rules, such as plurality, veto, and random ballot, are statistically robust, while others, such as approval, score v...
متن کاملGroup Fairness in Multiwinner Voting
We study multiwinner voting problems when there is an additional requirement that the selected committee should be fair with respect to attributes such as gender, ethnicity, or political parties. Every setting of an attribute gives rise to a group, and the goal is to ensure that each group is neither over nor under represented in the selected committee. Prior work has largely focused on designi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2021
ISSN: ['2633-1403']
DOI: https://doi.org/10.1016/j.artint.2020.103403